Making Simple Tabular ReductionWorks on Negative Table Constraints
نویسندگان
چکیده
Simple Tabular Reduction algorithms (STR) work well to establish Generalized Arc Consistency (GAC) on positive table constraints. However, the existing STR algorithms are useless for negative table constraints. In this work, we propose a novel STR algorithm and its improvement, which work on negative table constraints. Our preliminary experiments are performed on some random instances and a certain benchmark instances. The results show that the new algorithms outperform GAC-valid and the MDD-based GAC algorithm.
منابع مشابه
Sliced Table Constraints: Combining Compression and Tabular Reduction
Many industrial applications require the use of table constraints (e.g., in configuration problems), sometimes of significant size. During the recent years, researchers have focused on reducing space and time complexities of this type of constraint. Static and dynamic reduction based approaches have been proposed giving new compact representations of table constraints and effective filtering al...
متن کاملSTR 2 Optimized Simple Tabular Reduction for Table Constraints ⇤ Christophe Lecoutre CRIL - CNRS UMR
Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints and/or to compress their representation. In this paper, we describe an optimization of simple tabular reduction (STR), a technique proposed by J. Ullmann to dynamically maintain the tables of supports when generalized arc consistency (GAC...
متن کاملSTR 2 Optimized Simple Tabular Reduction for Table Constraints ∗ Christophe
Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints and/or to compress their representation. In this paper, we describe an optimization of simple tabular reduction (STR), a technique proposed by J. Ullmann to dynamically maintain the tables of supports when generalized arc consistency (GAC...
متن کاملA Compression Method for STR
Over the recent years, many filtering algorithms have been developed for table constraints. Simple Tabular Reduction (STR) is an effective approach to filter table constraints. It maintains dynamically the list of supports in each constraint table during inference and search. However, for some specific problems, the approach that consists in representing tables in a compact way by means of mult...
متن کاملUser interface layout with ordinal and linear constraints
User interfaces as well as documents use tabular layout mechanisms. The HTML table construct and the GridBag layout in Java are typical examples. There are, however, shortcomings of these mechanisms that become obvious with more advanced content like semi-structured data or object-oriented models. We present a generalized table construct that solves these shortcomings and generalizes tabular la...
متن کامل